home *** CD-ROM | disk | FTP | other *** search
- Path: newbridge.com!gminer
- From: gminer@Newbridge.COM (Glen Miner)
- Newsgroups: comp.lang.c
- Subject: Re: Huffman encoding
- Date: 4 Mar 1996 13:14:42 GMT
- Organization: Newbridge Networks Corporation
- Message-ID: <4heqc2$b7t@kannews.ca.newbridge.com>
- References: <4h00ci$euq@garuda.csulb.edu> <4h2fo4$4te@linet06.li.net> <4h4oph$kjj@texas.nwlink.com>
- NNTP-Posting-Host: thor143.ca.newbridge.com
-
- In article <4h4oph$kjj@texas.nwlink.com>,
- Teresa Reiko <tjr19@mail.nwlink.com> wrote:
- >aholder@li.net (Andrew Holder) wrote:
- >
- >>>Does anyone have any suggestions on how I can program a simple version
- >>>of Huffman encoding/decoding in the C language?
- >>>
- >>>I am looking for source code to implemet a "two-pass" Huffman encoding
- >>>scheme which would read characters from a file on the first pass and
- >>>then perform the encoding and the second pass...
- >>>
- >>>Any help or suggestions would be much, much appreciated!!
- >>
- >>Look for the uuecode program posted on this news group. that will give
- >>you some source code to go by. Good luck.
- >>
- >
- >Huh? UUencode is NOT the same as Huffman coding. UUencode is a way of
- >representing binary data as text for transmission in e-mail, etc, and
- >Huffman coding is representing any data with less bits, therefore
- >compressing it. Anyway, this discussion should be in comp.compression.
-
- Excuse me? I was under the impressiong that Huffman coding was an error
- detection scheme, but inserting parity bits in the data stream. It is
- renowned for it's natural ability to not only detect bad bits, but to
- determine which bit needs to be flipped.
-
- Not that this post isn't off topic, but it certainly doesn't belong in
- comp.compression :)
-
- Peace
- --
- _______________________________________________________________________________
- Wonko the Sane: gaminer@undergrad.math.uwaterloo.ca -> Peace.Love.Unity.Respect
-